Dependency Analysis of Synchronous Programming Languages
نویسندگان
چکیده
منابع مشابه
Synchronous Dependency Insertion Grammars: A Grammar Formalism For Syntax Based Statistical MT
This paper introduces a grammar formalism specifically designed for syntax-based statistical machine translation. The synchronous grammar formalism we propose in this paper takes into consideration the pervasive structure divergence between languages, which many other synchronous grammars are unable to model. A Dependency Insertion Grammars (DIG) is a generative grammar formalism that captures ...
متن کاملSignal • a Declaf:~tive Language for Synchronous Programming of Real-time Systems
A ~ T ~ C T We present an applicative language, SIGNAL, designed to program real-time systems. The language is based on a synchronous notion of time. We assume the execution of operations to have a zero logical time duration ; then, the sequence of communication events determines entirely a temporal reference. The ordering of the runable operations is limited only by the dependencies between th...
متن کاملInducing Word Alignments with Bilexical Synchronous Trees
This paper compares different bilexical tree-based models for bilingual alignment. EM training for the new model benefits from the dynamic programming “hook trick”. The model produces improved dependency structure for both languages.
متن کاملData-Flow Synchronous Languages
In this paper, we present a theory of synchronous data-flow languages. Our theory is supported by both some heuristic analysis of applications and some theoretical investigation of the data-flow paradigm. Our model covers both behavioural and operational aspects, and allows both synchronous and asynchronous styles of implementation for synchronous programs. This model served as a basis to estab...
متن کاملBetter Learning and Decoding for Syntax Based SMT Using PSDIG
As an approach to syntax based statistical machine translation (SMT), Probabilistic Synchronous Dependency Insertion Grammars (PSDIG), introduced in (Ding and Palmer, 2005), are a version of synchronous grammars defined on dependency trees. In this paper we discuss better learning and decoding algorithms for a PSDIG MT system. We introduce two new grammar learners: (1) an exhaustive learner com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010